A Very Fast (Linear Time) Distributed Algorithm, on General Graphs, for the Minimum-Weight Spanning Tree
نویسندگان
چکیده
In their pioneering paper [4], Gallager et al. introduced a distributed algorithm for constructing the minimum-weight spanning tree (MST), many authors have suggested ways to enhance their basic algorithm. Most of these improved algorithms have been shown to be very efficient in terms of reducing their worst-case communication and/or time complexity measures. In this paper, we address the problem of MST construction on general graphs. We present a new distributed algorithm for constructing the MST, which is linear in time and is faster than all previous linear algorithms. This algorithm is not to be compared with sublinear algorithms constructed on special graphs (graph diameter in order of logn) [5, 6].
منابع مشابه
Minimum Spanning Tree in Deterministic Linear Time For Graphs of High Girth
We show a simple deterministic linear time algorithm for computing the minimum spanning tree of graphs on n vertices with girth at least b(t, lg n), where t ≥ 1 is a constant and b(x, y) is a variant of the inverse of the fast-growing Ackermann function. We also prove: (i) A deterministic linear time algorithm for general graphs follows from an algorithm for graphs with girth at least g for any...
متن کاملFully Sequential and Distributed Dynamic Algorithms for Minimum Spanning Trees
In this paper, we present a fully-dynamic distributed algorithm for maintaining a minimum spanning tree on general graphs with positive real edge weights. The goal of a dynamic MST algorithm is to update e ciently the minimum spanning tree after dynamic changes like edge weight changes, rather than having to recompute it from scatch each time. The rst part of the paper surveys various algorithm...
متن کاملThe First Approximated Distributed Algorithm for the Minimum Degree Spanning Tree Problem on General Graphs
In this paper we present the first distributed algorithm on general graphs for the Minimum Degree Spanning Tree problem. The problem is NP-hard in sequential. Our algorithm give a Spanning Tree of a degree at most 1 from the optimal. The resulting distributed algorithm is asynchronous, it works for named asynchronous arbitrary networks and achieves O(|V |) time complexity and O(|V | |E|) messag...
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملChance-Constrained Programming Models and Approximation Algorithms for General Stochastic Bottleneck Spanning Tree Problems
This paper considers a balance-constrained stochastic bottleneck spanning tree problem (BCSBSTP) in which edge weights are independently distributed but may follow arbitrary random distributions. The problem minimizes a scalar and seeks a spanning tree, of which the maximum edge weight is bounded by the scalar for a given certain probability, and meanwhile the minimum edge weight is lower bound...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2001